An adjustable linear time parallel algorithm for maximum weight bipartite matching
نویسندگان
چکیده
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O( ω ) using O(nmax(2ω,4+ω)) processing elements for ω ≥ 1. Parameter ω is not bounded. This is the fastest known strongly polynomial parallel algorithm to solve this problem. This is also the first adjustable parallel algorithm for the maximum weight bipartite matching problem in which the execution time can be reduced by an unbounded factor. We also present a general approach for finding efficient parallel algorithms for the maximum matching problem.
منابع مشابه
On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملA distributed-memory approximation algorithm for maximum weight perfect bipartite matching
We design and implement an efficient parallel approximation algorithm for the problem of maximum weight perfect matching in bipartite graphs, i.e. the problem of finding a set of non-adjacent edges that covers all vertices and has maximum weight. This problem differs from the maximum weight matching problem, for which scalable approximation algorithms are known. It is primarily motivated by fin...
متن کاملCS369E: Communication Complexity (for Algorithm Designers) Lectures #5–6: Lower Bounds for the Extension Complexity of Polytopes∗
You’ve probably seen some polynomial-time algorithms for the problem of computing a maximum-weight matching of a bipartite graph. Many of these, like the Kuhn-Tucker algorithm [?] are “combinatorial algorithms,” meaning that all of its steps work directly with the graph. Linear programming is also an effective tool for solving many discrete optimization problems. For example, consider the follo...
متن کاملComplexity ( for Algorithm Designers ) Lecture # 5 : Lower Bounds for the Extension
You’ve probably seen some polynomial-time algorithms for the problem of computing a maximum-weight matching of a bipartite graph. Many of these, like the Kuhn-Tucker algorithm [9], are “combinatorial algorithms” that operate directly on the graph. Linear programming is also an effective tool for solving many discrete optimization problems. For example, consider the following linear programming ...
متن کاملUsing Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
In this paper we use interior-point methods for linear programming, developed in the context of sequential computation, to obtain a parallel algorithm for the bipartite matching problem. Our algorithm nds a maximum cardinality matching in a bipartite graph with n nodes and m edges in O(pm log3 n) time on a CRCW PRAM. Our results extend to the weighted bipartite matching problem and to the zero-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 97 شماره
صفحات -
تاریخ انتشار 2006